See Bloom filter on Wiktionary
{
"etymology_text": "Conceived by Burton Howard Bloom in 1970.",
"forms": [
{
"form": "Bloom filters",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Bloom filter (plural Bloom filters)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not."
],
"id": "en-Bloom_filter-en-noun-2KUQu-Rm",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"probabilistic",
"probabilistic"
],
[
"data structure",
"data structure"
],
[
"element",
"element"
],
[
"set",
"set"
]
],
"raw_glosses": [
"(computing theory) A space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Bloom filter"
]
}
],
"word": "Bloom filter"
}
{
"etymology_text": "Conceived by Burton Howard Bloom in 1970.",
"forms": [
{
"form": "Bloom filters",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Bloom filter (plural Bloom filters)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Theory of computing"
],
"glosses": [
"A space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"probabilistic",
"probabilistic"
],
[
"data structure",
"data structure"
],
[
"element",
"element"
],
[
"set",
"set"
]
],
"raw_glosses": [
"(computing theory) A space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Bloom filter"
]
}
],
"word": "Bloom filter"
}
Download raw JSONL data for Bloom filter meaning in All languages combined (1.3kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.